Polarized Games
نویسنده
چکیده
We generalize the intuitionistic Hyland–Ong games (and in a second step Abramsky–Jagadeesan– Malacaria games) to a notion of polarized games allowing games with plays starting by proponent moves. The usual constructions on games are adjusted to fit this setting yielding game models for both Intuitionistic Linear Logic and Polarized Linear Logic. We prove a definability result for this polarized model and this gives complete game models for various classical systems: LC, λμ-calculus, . . . for both call-by-name and call-by-value evaluations.
منابع مشابه
Desequentialization of Games and Experiments on Proof-nets
We study the comparison of dynamic semantics (games, dealing with interactions) with static semantics (dealing with results of interactions), in the spirit of Timeless Games [2]. We carefully analyze Laurent’s polarized proof-nets (which for the game semantics is full and faithful [8]) and we detail the precise correspondence between cut free proof-nets and innocent strategies, in a framework r...
متن کاملThick Subtrees, Games and Experiments
We relate the dynamic semantics (games, dealing with interactions) and the static semantics (dealing with results of interactions) of linear logic with polarities, in the spirit of Timeless Games [1]. The polarized game semantics is full and faithfull for polarized proof-nets [2]. We detail the correspondence between cut free proof-nets and innocent strategies, in a framework related to abstrac...
متن کاملOn the Complexity of Cockett-seely Polarized Games
In this paper the complexity of provability of polarized additive, multiplicative, and exponential formulas in the (initial) Cockett-Seely polarized game logic is discussed. The complexity is ultimately based on the complexity of finding a strategy in a formula which is, for polarized additive formulas, in the worst case linear in their size. Having a proof of a sequent is equivalent to having ...
متن کاملPolarized Category Theory , Modules , and Game Semantics
Motivated by an analysis of Abramsky-Jagadeesan games, the paper considers a categorical semantics for a polarized notion of two-player games, a semantics which has close connections with the logic of (finite cartesian) sums and products, as well as with the multiplicative structure of linear logic. In each case, the structure is polarized, in the sense that it will be modelled by two categorie...
متن کاملProjecting Games on Hypercoherences
We compare two interpretations of programming languages: game semantics (a dynamic semantics dealing with computational traces) and hypercoherences (a static semantics dealing with results of computation). We consider polarized bordered games which are Laurent’s polarized games endowed with a notion of terminated computation (the border) allowing for a projection on hypercoherences. The main re...
متن کامل